Exact and approximate solutions for the quantum minimum-Kullback-entropy estimation problem

Exact and Approximate Solutions of the Perspective-3-point Problem

Model-based pose estimation techniques which match image and model triangles require large numbers of matching operations in real world applications. We show that by using approximations to perspective, 2D lookup tables can be built for each of the triangles of the models. An approximation called \weak perspective" has been applied previously to this problem; we consider two other perspective a...

Exact and Approximate Solutions of the Perspective-Three-Point Problem

The minimum Manhattan network problem: Approximations and exact solutions

Given a set of points in the plane and a constant t ≥ 1, a Euclidean t-spanner is a network in which, for any pair of points, the ratio of the network distance and the Euclidean distance of the two points is at most t. Such networks have applications in transportation or communication network design and have been studied extensively. In this paper we study 1-spanners under the Manhattan (or L1-...

The Exact Renormalization Group and Approximate Solutions

We investigate the structure of Polchinski’s formulation of the flow equations for the continuum Wilson effective action. Reinterpretations in terms of I.R. cutoff greens functions are given. A promising non-perturbative approximation scheme is derived by carefully taking the sharp cutoff limit and expanding in ‘irrelevancy’ of operators. We illustrate with two simple models of four dimensional...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.